Semantic Visualization with Neighborhood Graph Regularization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Visualization with Neighborhood Graph Regularization

Visualization of high-dimensional data, such as text documents, is useful to map out the similarities among various data points. In the high-dimensional space, documents are commonly represented as bags of words, with dimensionality equal to the vocabulary size. Classical approaches to document visualization directly reduce this into visualizable two or three dimensions. Recent approaches consi...

متن کامل

Common Neighborhood Graph

Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltoni...

متن کامل

The Common Neighborhood Graph and Its Energy

Let $G$ be a simple graph with vertex set ${v_1,v_2,ldots,v_n}$. The common neighborhood graph (congraph) of $G$, denoted by $con(G)$, is the graph with vertex set ${v_1,v_2,ldots,v_n}$, in which two vertices are adjacent if and only they have at least one common neighbor in the graph $G$. The basic properties of $con(G)$ and of its energy are established.

متن کامل

From paragraph to graph: latent semantic analysis for information visualization.

Most techniques for relating textual information rely on intellectually created links such as author-chosen keywords and titles, authority indexing terms, or bibliographic citations. Similarity of the semantic content of whole documents, rather than just titles, abstracts, or overlap of keywords, offers an attractive alternative. Latent semantic analysis provides an effective dimension reductio...

متن کامل

Sentiment Classification with Graph Co-Regularization

Sentiment classification aims to automatically predict sentiment polarity (e.g., positive or negative) of user-generated sentiment data (e.g., reviews, blogs). To obtain sentiment classification with high accuracy, supervised techniques require a large amount of manually labeled data. The labeling work can be time-consuming and expensive, which makes unsupervised (or semisupervised) sentiment a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Artificial Intelligence Research

سال: 2016

ISSN: 1076-9757

DOI: 10.1613/jair.4983